Cluster interpretation of parity splitting in alternating parity bands
نویسندگان
چکیده
منابع مشابه
Parity-alternating permutations and successions
The study of parity-alternating permutations of {1, 2, . . . , n} is extended to permutations containing a prescribed number of parity successions – adjacent pairs of elements of the same parity. Several enumeration formulae are computed for permutations containing a given number of parity successions, in conjunction with further parity and length restrictions. The objects are classified using ...
متن کاملAlternating traps in Muller and parity games
Muller games are played by two players moving a token along a graph; the winner is determined by the set of vertices that occur infinitely often. The central algorithmic problem is to compute the winning regions for the players. Different classes and representations of Muller games lead to problems of varying computational complexity. One such class are parity games; these are of particular sig...
متن کاملWeak Parity Games and Language Containment of Weak Alternating Parity Automata
Optimisations of the state space of weak alternating parity automata (WAPA) are needed for example to speed up μTL model-checking algorithms which involve WAPA. It is assumed that deciding language containment for WAPA is helpful to perform such optimisations. In this paper the problem of language containment is reduced to the problem of computing winning sets in weak parity games. For the latt...
متن کاملCombinatorics in the group of parity alternating permutations
We call a permutation parity alternating, if its entries assume even and odd integers alternately. Parity alternating permutations form a subgroup of the symmetric group. This paper deals with such permutations classified by two permutation statistics; the numbers of ascents and inversions. It turns out that they have a close relationship to signed Eulerian numbers. The approach is based on a s...
متن کاملStatic analysis of parity games: alternating reachability under parity1
It is well understood that solving parity games is equivalent, up to polynomial time, to model checking of the modal mu-calculus. It is a long-standing open problem whether solving parity games (or model checking modal mu-calculus formulas) can be done in polynomial time. A recent approach to studying this problem has been the design of partial solvers, algorithms that run in polynomial time an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 2002
ISSN: 0370-2693
DOI: 10.1016/s0370-2693(01)01512-x